Search results for "Continued fractions"
showing 5 items of 5 documents
Selmer's Multiplicative Algorithm
2011
Abstract.The behavior of the multiplicative acceleration of Selmer's algorithm is widely unknown and no general result on convergence has been detected yet. Solely for its 2-dimensional, periodic expansions, there exist some results on convergence and approximation due to Fritz Schweiger. In this paper we show that periodic expansions of any dimension do in fact converge and that the coordinates of the limit points are rational functions of the largest eigenvalue of the periodicity matrix.
On Sturmian Graphs
2007
AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of compact directed acyclic word graphs of central Sturmian words. In order to prove this result, we give a characterization of the maximal repeats of central Sturmian words. We show also that, in analogy with the case of Sturmian words, these graphs converge to infinite ones.
On lazy representations and Sturmian graphs
2011
In this paper we establish a strong relationship between the set of lazy representations and the set of paths in a Sturmian graph associated with a real number α. We prove that for any non-negative integer i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ostrowski numeration system associated with α. Moreover, we provide several properties of the representations of the natural integers in this numeration system.
Sturmian graphs and integer representations over numeration systems
2012
AbstractIn this paper we consider a numeration system, originally due to Ostrowski, based on the continued fraction expansion of a real number α. We prove that this system has deep connections with the Sturmian graph associated with α. We provide several properties of the representations of the natural integers in this system. In particular, we prove that the set of lazy representations of the natural integers in this numeration system is regular if and only if the continued fraction expansion of α is eventually periodic. The main result of the paper is that for any number i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ost…
Эмануэль Гринберг - выдающиеся достижения в прикладной математике: радио-фильтры, корпуса танкеров, графы и интегральные схемы Emanuels Grinbergs - i…
2018
The paper is dedicated to the 50th anniversary of the Grinberg theorem. The main works of Emanuel Grinberg (1911-1982) in applied mathematics are described, following the stages of his life path, namely: the design of radio receivers and the calculation of radio filters (1949-1959), hull of tanker calculations (1962-1964), the study of graph theory and the proof of the Grinberg theorem (1968), designing of integrated circuits (1968-1980). Calculations of radio filters are associated with the expansion of the use of continued fractions for the analysis of linear electric circuits (the Kauer model) and the developing of new tools – the Grinberg brackets (as an extension of the Euler brackets)…